Image compression by linear splines over adaptive triangulations

نویسندگان

  • Laurent Demaret
  • Nira Dyn
  • Armin Iske
چکیده

This paper proposes a new method for image compression. The method is based on the approximation of an image, regarded as a function, by a linear spline over an adapted triangulation, D(Y ), which is the Delaunay triangulation of a small set Y of significant pixels. The linear spline minimizes the distance to the image, measured by the mean square error, among all linear splines over D(Y ). The significant pixels in Y are selected by an adaptive thinning algorithm, which recursively removes less significant pixels in a greedy way, using a sophisticated criterion for measuring the significance of a pixel. The proposed compression method combines the approximation scheme with a customized scattered data coding scheme. We compare our compression method with JPEG2000 on two geometric images and on three popular test cases of real images. Zusammenfassung. Dieser Artikel stellt eine neue Methode zur Bildkompression vor. Diese Methode beinhaltet die Approximation eines gegebenen Bildes, hier aufgefasst als eine Funktion über den diskreten Bildpunkten, durch eine lineare Splinefunktion über einer adaptiven Triangulierung, D(Y ), wobei D(Y ) die Delaunay-Triangulierung einer kleinen Teilmenge Y signifikanter Bildpunkte bezeichnet. Diese lineare Splinefunktion minimiert dabei unter allen linearen Splinefunktionen über D(Y ) die Distanz zu dem vorliegenden Bild, die durch die gemittelte Summe der Fehlerquadrate gemessen wird. Die signifikanten Bildpunkte werden unter Verwendung eines adaptiven Thinning-Algorithmus ausgewählt, der weniger signifikante Bildpunkte aus der gegebenen Menge aller Bildpunkte rekursiv entfernt. Zum Entfernen der Bildpunkte wird dabei ein geeignetes Bewertungskriterium verwendet, mit dem Signifikanzen einzelner Bildpunkte gemessen werden können. Die hier vorgestellte Kompressionsmethode kombiniert das verwendete Approximationsschema mit einer passenden Kodierungsmethode für unstrukturierte planare Punktmengen. Unsere Kompressionsmethode wird schliesslich unter Verwendung von zwei geometrischen Testbeispielen und drei populären realen Testbildern mit JPEG2000 verglichen.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal N-term approximation by linear splines over anisotropic Delaunay triangulations

Anisotropic triangulations provide efficient geometrical methods for sparse representations of bivariate functions from discrete data, in particular from image data. In previous work, we have proposed a locally adaptive method for efficient image approximation, called adaptive thinning, which relies on linear splines over anisotropic Delaunay triangulations. In this paper, we prove asymptotical...

متن کامل

Advances in Digital Image Compression by Adaptive Thinning

This paper proposes a novel concept for digital image compression. The resulting compression scheme relies on adaptive thinning algorithms, which are recent multiresolution methods from scattered data approximation. Adaptive thinning algorithms are recursive point removal schemes, which are combined with piecewise linear interpolation over decremental Delaunay triangulations. This paper shows t...

متن کامل

Adaptive Thinning for Terrain Modelling and Image Compression

Adaptive thinning algorithms are greedy point removal schemes for bivariate scattered data sets with corresponding function values, where the points are recursively removed according to some data-dependent criterion. Each subset of points, together with its function values, defines a linear spline over its Delaunay triangulation. The basic criterion for the removal of the next point is to minim...

متن کامل

Convexity preserving splines over triangulations

A general method is given for constructing sets of sufficient linear conditions that ensure convexity of a polynomial in Bernstein–Bézier form on a triangle. Using the linear conditions, computational methods based on macro-element spline spaces are developed to construct convexity preserving splines over triangulations that interpolate or approximate given scattered data.

متن کامل

Image Zooming using Non-linear Partial Differential Equation

The main issue in any image zooming techniques is to preserve the structure of the zoomed image. The zoomed image may suffer from the discontinuities in the soft regions and edges; it may contain artifacts, such as image blurring and blocky, and staircase effects. This paper presents a novel image zooming technique using Partial Differential Equations (PDEs). It combines a non-linear Fourth-ord...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Signal Processing

دوره 86  شماره 

صفحات  -

تاریخ انتشار 2006